Path Query
نویسنده
چکیده
DEFINITION Given a semi-structured data set D, a path query identifies nodes of interest by specifying the path lead to the nodes and the predicates associated with nodes along the path. The path is identified by specifying the labels of the nodes to be navigated and structural relationship (parent-child or ancestor-descendant) among the nodes. A predicate can be a path query itself, relative to the node that is associated with.
منابع مشابه
An Effective Path-aware Approach for Keyword Search over Data Graphs
Abstract—Keyword Search is known as a user-friendly alternative for structured languages to retrieve information from graph-structured data. Efficient retrieving of relevant answers to a keyword query and effective ranking of these answers according to their relevance are two main challenges in the keyword search over graph-structured data. In this paper, a novel scoring function is proposed, w...
متن کاملPath Results for Context-free Grammar Queries on Graphs
Navigational queries for graph-structured data, such as the regular path queries and the context-free path queries, are usually evaluated to a relation of node-pairs (m,n) such that there is a path from m to n satisfying the conditions of the query. Although this relational query semantics has practical value, we believe that the relational query semantics can only provide limited insight in th...
متن کاملPath Maximum Query and Path Maximum Sum Query in a Tree
Let T be a node-weighted tree with n nodes, and let π(u, v) denote the path between two nodes u and v in T . We address two problems: (i) Path Maximum Query: Preprocess T so that, for a query pair of nodes u and v, the maximum weight on π(u, v) can be found quickly. (ii) Path Maximum Sum Query: Preprocess T so that, for a query pair of nodes u and v, the maximum weight sum subpath of π(u, v) ca...
متن کاملEffective Schema-Based XML Query Optimization Techniques
Use of path expressions is a common feature in most XML query languages, and many evaluation methods for path expression queries have been proposed recently. However, there are few researches on the issue of optimizing regular path expression queries. In this paper, two kinds of path expression optimization principles are proposed, named path shortening and path complementing, respectively. The...
متن کاملQuery Optimization Techniques Utilizing Path Indexesin
We propose query optimization techniques that fully utilize the advantages of path indexes in object-oriented database systems. Although path indexes provide an eecient access to complex objects, little research has been done on query optimization that fully utilize path indexes. We rst devise a generalized index intersection technique, adapted to the structure of the path index extended from c...
متن کاملQuery Optimization Techniques Utilizing Path Indexes in Object-Oriented Database Systems
We propose query optimization techniques that fully utilize the advantages ojpath indexes in object-oriented database systems. Although path indexes provide an eficient access to complex objects, little research has been done on query optimization that fully utilize path indexes. We first devise a generalized index intersection technique, adapted to the structure of the path index extended from...
متن کامل